Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case
نویسندگان
چکیده
منابع مشابه
Maximally Paraconsistent Three-Valued Logics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We ...
متن کاملFrom paraconsistent three-valued logics to multiple-source epistemic logic
Several interpretations can be given to the third truth value in three-valued logics. Here, we consider the case when it refers to the epistemic notion of contradictory, or both true and false at the same time. We study several paraconsistent threevalued logics that carry this concern and show that they can be translated into a fragment of a simple epistemic logic where modalities can only appe...
متن کاملParaconsistent Resolution for Four-valued Description Logics
In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make anyALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valuedALC. Our approach can be...
متن کاملFour-valued Logics for Paraconsistent Reasoning
A drawback of many logics for reasoning on Semantic Web ontologies is the Principle of Explosion in case of inconsistent data. Considering a four-valued semantics, inconsistencies can be tolerated such that paraconsistency is obtained. We extend Belnap’s four-valued logic to a four-valued first-order logic with implication and equality, and we develop a method for translating formulas to a repr...
متن کاملParaconsistent Logics!
In this note I respond to Hartley Slater's argument [12] to the e ect that there is no such thing as paraconsistent logic. Slater's argument trades on the notion of contradictoriness in the attempt to show that the negation of paraconsistent logics is merely a subcontrary forming operator and not one which forms contradictories. I will show that Slater's argument fails, for two distinct reasons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2020
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2020.10.006